Polynomial approximations of a class of stochastic multiscale elasticity problems
نویسندگان
چکیده
منابع مشابه
A special Class of Stochastic PERT Networks
Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.
In series-parallel SPN, the completion time distribution...
متن کاملA special Class of Stochastic PERT Networks
Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...
متن کاملUsing Polynomial Approximations to Solve Stochastic Dynamic Programming Problems: or A “Betty Crocker” Approach to SDP
In this paper we put forward an easy-to-implement methodology for solving deterministic or stochastic dynamic programming problems within a standard optimization package such as GAMS. We’ve found the use of orthogonal polynomials to be especially helpful in implementing approximation methods for iterative computation of the infinite-horizon value function, due to their superior convergence prop...
متن کاملUNIQUENESS OF SOLUTION FOR A CLASS OF STEFAN PROBLEMS
This paper deals with a theoretical mathematical analysis of one-dimensional solidification problem, in which kinetic undercooling is incorporated into the This temperature condition at the interface. A model problem with nonlinear kinetic law is considered. We prove a local result intimate for the uniqueness of solution of the corresponding free boundary problem.
متن کاملA Class of Stochastic Programming Decision Problems
A class of probabilistic constrained programming problems are considered where the probabilistic constraint is of the form P{gi(x, ξ) ≥ 0, i = 1, . . . , r} ≥ p and the functions gi, i = 1, . . . , r are concave. It is shown that the x-function on the left hand side is logarithmic concave provided ξ has a logarithmic concave density. Special cases are mentioned and algorithmic solution of probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Zeitschrift für angewandte Mathematik und Physik
سال: 2016
ISSN: 0044-2275,1420-9039
DOI: 10.1007/s00033-016-0669-4